Iterative decoding of serially concatenated convolutional codes - Electronics Letters

نویسندگان

  • S. Benedetto
  • G. Montorsi
چکیده

where p is an empirically chosen constant (0 < 1-1 < 2). The modification in the MBTS algorithm is in the last step where the quantisation levels are calculated. In the BTS algorithm the quantisation levels are selected at cluster centres. In MBTS, they are displaced from the cluster centres to facilitate the representation of more colours within a cluster with closer quantisation colours (eqn. 2).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers

A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...

متن کامل

Hybrid Concatenated Codes and Iterative Decoding

A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...

متن کامل

Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding

A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer codewords’ bits, and an inner code whose input words are the permuted outer codewords. The construction can be generalized to h cascaded codes separated by h − 1 interleavers. We obtain upper bounds to the average maximum-likelihood bit-error probability of serially conc...

متن کامل

Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding - Information Theory, IEEE Transactions on

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords. The construction can be generalized to h cascaded encoders separated by h 1 interleavers. We obtain upper bounds to the average maximumlikelihood bit error probability of serially co...

متن کامل

Performance Comparison of Serial Concatenated Convolutional Codes and Parallel Concatenated Convolutional Codes on Faded Channels

The performance comparison of Serially Concatenated Convolutional Codes (SCCC) and Parallel Concatenated Convolutional Codes (PCCC) is evaluated on Additive White Gaussian Noise model channel, which is used as a basis, and actions of SCCC and PCCC on Raleigh faded channels are evaluated in this research work. In DCS the SCCC and PCCC are utilized to reduce the bit error rates. SCCC and PCCC enc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004